Assume, guarantee or repair: a regular framework for non regular properties

نویسندگان

چکیده

Abstract We present Assume-Guarantee-Repair (AGR)—a novel framework which verifies that a program satisfies set of properties and also repairs the in case verification fails. consider communicating programs —these are simple C-like programs, extended with synchronous actions over communication channels. Our method, consists learning-based approach to assume–guarantee reasoning, performs repair simultaneously: every iteration, AGR either makes another step towards proving (current) system required properties, or alters way brings it closer satisfying properties. To handle infinite-state systems we build finite abstractions, for check satisfaction complex contain first-order constraints, using both syntactic semantic-aware methods. implemented evaluated on various protocols. experiments compact proofs correctness quick repairs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A lattice-theoretic framework for circular assume-guarantee reasoning

We develop an abstract lattice-theoretic framework within which we study soundness and other properties of circular assume-guarantee (A-G) rules constrained by side conditions. We identify a particular side condition, non-blockingness, which admits an intelligible inductive proof of the soundness of circular A-G reasoning. Besides, conditional circular rules based on non-blockingness turn out t...

متن کامل

A Learning Framework for Automatic Assume-Guarantee Verification

Compositional verification is a promising approach to addressing the state explosion problem associated with model checking. One compositional technique advocates proving properties of a system by checking properties of its components in an assume-guarantee style. However, the application of this technique is difficult because it involves non-trivial human input. This paper presents a novel fra...

متن کامل

Verification of Non-Regular Properties

We present a game-based formalism that can be used to do local model checking for FLC, a modal fixed point logic that extends the μ-calculus with a sequential composition operator. This logic is capable of expressing non-regular properties which are interesting for verification purposes.

متن کامل

Regular and non-regular point sets: Properties and reconstruction

In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants, which are polygonal approximations of curves and surfaces satisfying a new regularity condition. This new condition, which is an extension of the popular notion of r-sampling to the practical case of discrete shapes, seems much more realistic than previously proposed...

متن کامل

Assume-Guarantee Model Checking

We present assume-guarantee model checking, a novel technique for verifying correctness properties of loosely-coupled multithreaded software systems. Assume-guarantee model checking verifies each thread of a multithreaded system separately by constraining the actions of other threads with an automatically inferred environment assumption. Separate verification of each thread allows the enumerati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal on Software Tools for Technology Transfer

سال: 2022

ISSN: ['1433-2779', '1433-2787']

DOI: https://doi.org/10.1007/s10009-022-00669-9